Incomplete graphical model inference via latent tree aggregation
نویسندگان
چکیده
منابع مشابه
Nonparametric Latent Tree Graphical Models: Inference, Estimation, and Structure Learning
Tree structured graphical models are powerful at expressing long range or hierarchical dependency among many variables, and have been widely applied in different areas of computer science and statistics. However, existing methods for parameter estimation, inference, and structure learning mainly rely on the Gaussian or discrete assumptions, which are restrictive under many applications. In this...
متن کاملLearning Latent Tree Graphical Models
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees without any redundant hidden nodes. Unlike many existing methods, the observed nodes (or variables) are not constrained to be leaf nodes. Our algorithms can...
متن کاملKernel Embeddings of Latent Tree Graphical Models
Latent tree graphical models are natural tools for expressing long range and hierarchical dependency among many variables which are common in computer vision, bioinformatics and natural language processing problems. However, existing models are largely restricted to discrete and Gaussian variables due to computational constraints; furthermore, algorithms for estimating the latent tree structure...
متن کاملDiscussion : Latent Variable Graphical Model Selection via Convex Optimization
1. Introduction. We would like to congratulate the authors for their refreshing contribution to this high-dimensional latent variables graphical model selection problem. The problem of covariance and concentration matrices is fundamentally important in several classical statistical methodolo-gies and many applications. Recently, sparse concentration matrices estimation had received considerable...
متن کاملOf ” Latent Variable Graphical Model Selection via Convex Optimization
Since recently, there have been an increasing interest in the problem of estimating a high-dimensional matrix K that can be decomposed in a sum of a sparse matrix S∗ (i.e., a matrix having only a small number of nonzero entries) and a low rank matrix L∗. This is motivated by applications in computer vision, video segmentation, computational biology, semantic indexing etc. The main contribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistical Modelling
سال: 2018
ISSN: 1471-082X,1477-0342
DOI: 10.1177/1471082x18786289